Computing Abductive Explanations

We study the computation of constrained explanations in framework abductive logic programming. A general characteristic reasoning is existence multiple explanations. Therefore, identifying a subclass “preferred explanations” relevant problem. typical approach to “prefer” that are, some sense, simple. Several concepts simplicity were considered literature, most notably those based on minimality with respect inclusion and cardinality. adopt, as measure quality an explanation, its degree arbitrariness can be briefly described number arbitrary assumptions have been made derive explanation. The more less appealing it is, having no arbitrariness, called constrained, being preferred ones. In this article, we present technique that, for special class theories, computes It rewriting theory observation into disjunctive program negation so correspond subset stable models. proposed lays foundation using ASP solvers compute